例句與造句

1. While designed for convex problems, AdaGrad has been successfully applied to non-convex optimization.
2. Solving even close-to-convex but non-convex problems can be computationally intractable.
3. Examples of algorithms that solve convex problems by hill-climbing include the simplex algorithm for linear programming and binary search.
4. The first form can be applied only in the convex problems, while the second form is universal and can be used in general nonlinear problems.
5. This is unlike the standard sequential minimal optimization ( SMO )-based algorithms employed by SVMs, which are guaranteed to find a global optimum ( of the convex problem ).
6. It's difficult to find convex problem in a sentence. 用convex problem造句挺難的
7. While the worst-case convergence rate with O ( 1 / k ) can not be improved in general, faster convergence can be obtained for special problem classes, such as some strongly convex problems.
8. In a convex problem, if there is a local minimum that is interior ( not on the edge of the set of feasible points ), it is also the global minimum, but a nonconvex problem may have more than one local minimum not all of which need be global minima.
9. Hill climbing is good for finding a local optimum ( a solution that cannot be improved by considering a neighbouring configuration ) but it is not necessarily guaranteed to find the best possible solution ( the global optimum ) out of all possible solutions ( the convex problems, hill-climbing " is " optimal.